#include<iostream>
#include<queue>
#include<list>
#include<vector>
using namespace std;

#include"priority_queue.h"



int main()
{
	Priority_queue::priority_queue<int, vector<int>, Greater<int>> pq;
	pq.push(6);
	pq.push(1);
	pq.push(19);
	pq.push(2);
	pq.push(56);
	while (!pq.empty())
	{
		cout << pq.top() << ' ';
		pq.pop();
	}
	cout << endl;

	/*Greater<int> le;
	cout << le(1, 2) << endl;*/

	return 0;
}